#include <set>
#include <iostream>
#include <algorithm>
#include <cstdlib>

using namespace std;

int main(int argc, char const *argv[])
{
  int n = 0;
  cin>>n;
  int k =sqrt(2 * n);
  int maxK = k * (k + 1) / 2;
  if (maxK < n) {
    k += 1;
    maxK = k * (k + 1) / 2;
  }
  int x = 0;
  int y = 0;
  if (k % 2 == 0)
  {
    y = k - (maxK - n);
  }
  else
  {
    y = maxK - n + 1;
  }
  x = k + 1 - y;
  cout <<y<<"/"<<x;
  cout<<endl;
  
  return 0;
}
